Blockchain architecture, system, method and device for automated cybersecurity and data privacy law compliance with a partitioned replication protocol

ABSTRACT

A distributed transaction and data storage platform including a distributed notary ledger or blockchain and one or more individual user micro-identifier chains that together enable the secure effectuation and recordation of one or more transactions, and/or storage of data in an automated, real-time, zero-trust, globally data law and privacy law centric manner while maintaining transaction party confidentiality and preventing chain poisoning.

RELATED APPLICATIONS

This patent application is a continuation-in-part of the co-pending U.S. patent application Ser. No. 16/855,918, filed Apr. 22, 2020, entitled “A BLOCKCHAIN ARCHITECTURE, SYSTEM, METHOD AND DEVICE FOR AUTOMATED CYBERSECURITY AND DATA PRIVACY LAW COMPLIANCE WITH DELAYED BLOCK POSTING PROTOCOL,” and claims priority under 35 U.S.C. 119(e) of the co-pending U.S. Provisional Patent Application No. 62/902,456, filed Sep. 19, 2019, entitled “ENTERPRISE GRADE DATABASE AND TRANSACTION PLATFORM WITH CONTINUOUS, AUTOMATED WORLDWIDE DATA PRIVACY LAW COMPLIANCE,” and co-pending U.S. Provisional Patent Application No. 62/982,517, filed Feb. 27, 2020, entitled “ENTERPRISE GRADE DISTRIBUTED DATA STORAGE AND TRANSACTION PLATFORM WITH CONTINUOUS, AUTOMATED WORLDWIDE DATA PRIVACY LAW AND REGULATORY LAW COMPLIANCE, IMPERVIOUS TO CYBER ATTACKS AND UTILIZING AN AI/MACHINE LEARNING BIOMETRIC SECURITY LOCK WITH A PROOF OF LIVENESS TEST FOR ID AND ACCESS,” all of which are hereby incorporated by reference.

FIELD OF THE INVENTION

The present invention relates to the field of distributed ledger and blockchain systems. More particularly, the present invention relates to a plurality of interoperating distributed ledger and blockchain systems for enabling distributed data storage and distributed secure transactions and preventing chain poisoning while being globally and autonomously data privacy law and regulatory law compliant in a zero-trust manner.

BACKGROUND OF THE INVENTION

Blockchain was the first fully functional distributed ledger technology. However, deployed blockchains are plagued with problems that limit, and inhibit, its vast potential. These include inability to scale, limit to the number of transactions per second, security vulnerabilities, inefficiency, and costly and problematic consensus mechanisms. Additionally, they are by their very nature unable to be compliant with international data privacy laws, including, but not limited to the GDPR and CCPA.

Moreover, blockchains are particularly susceptible to chain poisoning. Chain poisoning comes in two forms: privacy poisoning (which uses any individuals' Private Personal Information) or data poisoning (uses improper/illegal data i.e., a copyrighted song or clip of child pornography). All any person needs to do, to permanently “poison” a blockchain, is to embed just one single piece of personal information (Privacy Poisoning) or illegal improper data (Data Poisoning) into a transaction that is then put into a blockchain block. Once that poisoned block, containing that personal information or unlawful data is in turn posted a blockchain chain, that entire chain becomes poisoned as well. That result is that the chain is fully incapacitated as the poisoning immediately renders that entire chain unlawful/illegal under various international laws (i.e., data privacy, copyright, child pornography, etc.). Further, blockchain's immutability makes chain poisoning irreversible. There is no “antidote” once a blockchain has been discovered to have been chain poisoned. The “purging” of a chain after the posting of such poisoned blocks is near impossible, as blockchain's immutability prevents any blocks (poisoned or otherwise) from ever being erased, deleted or modified. Indeed, even if a blockchain is able to be remediated, all current chains have no offensive or defensive systems to prevent that chain from being immediately re-infected all over again.

SUMMARY OF THE INVENTION

A transaction platform including a notary distributed ledger or blockchain and one or more separate micro-identifier chains (MIDCs) that together enable the secure effectuation and recordation of one or more transactions and storage of data in an automated privacy and regulatory law compliant manner (with or without zero-trust) while maintaining transaction party confidentiality and preventing chain poisoning. The notary distributed ledgers or blockchains, as well as the MIDC's are able to use single transaction blocks to store, maintain and provide information about the parties related to the transactions which the blockchain is able to utilize in order to securely and quickly validate, execute and record the transactions. The single transaction blocks and distributed ledger, transaction and data store thereof is able to function as a public or private blockchain (e.g. a distributed blockchain or database across a plurality of computing devices that each store copies of transactions in one or more linked blocks, in this case single transaction blocks) that maintains a continuously-growing list of data records hardened against tampering and revision. In particular, unlike other blockchains where a single block is used to store thousands of transactions, the single transaction blockchain of this system is able to consist of data structure blocks with each block holding only one individual transaction, piece of data (e.g., document, audio file, video file, biometric characteristics, or other types of data) and/or the results of any blockchain executables. Each single transaction block of the blockchain is able to comprise a timestamp and information linking it to a previous block thereby defining the chain and maintaining an order of each of the records/transactions. Further, the blockchains are able to implement a partitioned RAFT replication protocol in order to distribute the recording workload and increase transaction throughput, processing speed and efficiency.

The native user data, as well as Private Personal Information (PPI) for each user is able to be stored on the micro-identifier chain. A plurality of MIDCs can be combined to form a micro-identifier chain arrays for the transaction platform. In some embodiments, MIDC stacked on top of each other look like a database in that they have rows, and columns. The single transaction blocks in each MIDC are the equivalent of cells in a database. This totality of these stacked MIDC combine together to form the distributed storage equivalent of a database that we call a Chain Arrayed Data Store. This Chained Arrayed Data Store and STB allow the system to emulate the CRUD (Create, Read, Update and Delete) of a database. As such it allows the system to be the only DLT or blockchain capable of modifying and or deleting data in such a manner not to compromise the integrity and immutability of the chain or DLT itself. As such it is the first DLT or blockchain that can solve the “Blockchain Paradox”—other existing DLT's or blockchains inability to delete data once placed on a blockchain, rendering said chain in perpetual violation of global data privacy laws that contain recitals of right of erasure or “Right to Be Forgotten.” In such embodiments, for each user, only a specified single transaction block (“STB”) of their micro-identification chain that stores de-identified user data is able to be accessed by the notary blockchain(s) in order to form on-chain transactions. The data stored on the notary chain(s), and the other single transaction blocks of that chain and the micro-identification chain(s) is kept secure from any intruders.

In some embodiments, the transaction platform enables the prevention of blockchain poisoning by preventing direct posting to the main blockchain by users (e.g. no posting of native user data from a MIDC side chain to the main chain), by employing a delayed posting protocol wherein artificial intelligence and/or machine learning assisted potential block scanning for privacy or data poisoning while still in a pre-posting posture (where each block only contains a single transaction and thus deletion/prevention does not affect posted non-poisoned transactions), and by enabling deletion of discovered poisoned blocks and/or if necessary an entire MIDC of the associated malicious user thereby leaving all other user MIDC's and the notary chain(s) intact.

In some embodiments, the platform utilizes a delegated proof of transaction consensus method that enables the transaction to be recorded in near real-time by assuming the “buyer” and “seller” are known “good” actors before consensus has been determined and corrected afterwards in the case of rightfully disputed transactions. In some embodiments, the transaction platform provides an off-chain database management system, that complies with General Data Protection Regulation (GDPR), California Consumer Privacy act (CCPA) and other data privacy laws, by only utilizing de-identified, encrypted, pseudoanonymized and fully anonymized user data to record transactions while securely storing the native user data separate from the transaction ledgers/blockchains such that erasure is able to be effectuated upon demand by the removal of the stored native user data thereby anonymizing the data recorded on the blocks having the associated transactions. This is done in a manner so not to compromise the very immutability of those blockchains.

A first aspect is directed to a blockchain transaction platform for recording transactions between a plurality of users having accounts and assigned unique identifiers and assigned public and private digital key pairs on the platform. The platform comprises a plurality of processing nodes of a notary blockchain, the nodes each having a node processor, a node memory storing a notary module and a blockchain memory partitioned into a plurality of horizontal partitions, the notary blockchain including a plurality of transaction blocks and at least one platform server including at least one platform processor and a non-transitory computer-readable medium storing a platform operating system, wherein when executed by the platform processor the platform operating system performs the steps of for each of the partitions, assigning a different one of the nodes as a leader for that partition, receiving a plurality of blockchain transaction objects each including a unique transaction identifier and details of a single transaction between any two or more of the users, assigning each of the blockchain transaction objects to one of the partitions and providing each of the blockchain transaction objects to the one of the nodes that is the leader of the partition that the object is assigned to, wherein when executed by the node processor, the notary module of each node of the nodes performs the steps of receiving a number of the blockchain transaction objects, and for each of the number determining whether the blockchain transaction object is assigned to the partition that the node is the leader of, determining whether the blockchain transaction object is assigned to one of the partitions that the node is a follower of, storing the blockchain transaction object on the node, sending copies of the blockchain transaction object to followers of the partition that the node is the leader of if the blockchain transaction object was determined to be assigned to the partition that the node is the leader of, in response to receiving a verification message from the platform server indicating that the blockchain transaction object is valid, locally posting the transaction object as a new block on the notary blockchain on the partition that the node is the leader of and distributing a node confirmation message to the followers of the partition that the node is the leader of indicating that the blockchain transaction object is valid, and in response to receiving a node confirmation message from another of the nodes indicating that the blockchain transaction object is valid, locally posting the transaction object as another block on the notary blockchain on the partition to which the blockchain transaction object is assigned that the node is the follower of.

In some embodiments, each of the partitions are a same size. In some embodiments, at least two of the partitions are different sizes. In some embodiments, when executed by the platform processor the platform operating system performs the steps of dynamically adjusting a size of one or more of the partitions from an initial size to a different size during operation of the platform. In some embodiments, the non-transitory computer-readable medium includes a transaction buffer and when executed by the platform processor the platform operating system performs the steps of storing the blockchain transaction objects in the transaction buffer. In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions is based on an assignment metric. In some embodiments, N of the nodes are leaders, the assignment metric is M mod N, and the assigning each of the blockchain transaction objects to the one of the partitions comprises determining a hash M of the transaction identifier of the blockchain transaction object, and determining M mod N. In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions is based on congestion levels of each of the nodes that are one of the leaders. In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions comprises determining whether the blockchain transaction object points to an existing block of the notary blockchain, disregarding results of the assignment metric if the blockchain transaction object does point to the existing block on the notary blockchain, and assigning the blockchain transaction object to the partition of the partitions in which the existing block is stored.

A second aspect is directed to a notary blockchain for recording transactions between a plurality of users having accounts and assigned unique identifiers and assigned public and private digital key pairs. The blockchain comprises a plurality of processing nodes, the nodes each having a node processor, a node memory storing a notary module and a blockchain memory partitioned into a plurality of horizontal partitions, the notary blockchain including a plurality of transaction blocks, wherein each of the partitions has a leader that is a different one of the nodes and each of the nodes is a follower of one or more of the partitions, and further wherein when executed by the node processor, the notary module of each node of the nodes performs the steps of receiving a number of blockchain transaction objects each assigned to one of the partitions and including a unique transaction identifier and details of a single transaction between any two or more of the users, and for each of the number determining whether the blockchain transaction object is assigned to the partition that the node is the leader of, determining whether the blockchain transaction object is assigned to one of the partitions that the node is a follower of, storing the blockchain transaction object on the node, sending copies of the blockchain transaction object to followers of the partition that the node is the leader of if the blockchain transaction object was determined to be assigned to the partition that the node is the leader of, in response to receiving a verification message indicating that the blockchain transaction object is valid, locally posting the transaction object as a new block on the notary blockchain on the partition that the node is the leader of and distributing a node confirmation message to the followers of the partition that the node is the leader of indicating that the blockchain transaction object is valid, and in response to receiving a node confirmation message from another of the nodes indicating that the blockchain transaction object is valid, locally posting the transaction object as another block on the notary blockchain on the partition to which the blockchain transaction object is assigned that the node is the follower of. In some embodiments, each of the partitions are a same size. In some embodiments, at least two of the partitions are different sizes.

A third aspect is directed to a blockchain transaction platform server for operating with a plurality of processing nodes of a notary blockchain including a plurality of transaction blocks, the nodes each having a blockchain memory partitioned into a plurality of horizontal partitions. The server comprises at least one platform processor, and a non-transitory computer-readable medium storing a platform operating system, wherein when executed by the platform processor the platform operating system performs the steps of for each of the partitions, assigning a different one of the nodes as a leader for that partition, receiving a plurality of blockchain transaction objects each including a unique transaction identifier and details of a single transaction between any two or more of the users, assigning each of the blockchain transaction objects to one of the partitions, and providing each of the blockchain transaction objects to the one of the nodes that is the leader of the partition that the object is assigned to.

In some embodiments, when executed by the platform processor the platform operating system performs the steps of, for each of the blockchain transaction objects provided to the one of the nodes that is the leader of the partition that the object is assigned to, providing a subsequent verification message to the one of the nodes, the verification message indicating that the blockchain transaction object provided is valid and authorized to be posted on the notary. In some embodiments, each of the partitions are a same size. In some embodiments, at least two of the partitions are different sizes. In some embodiments, when executed by the platform processor the platform operating system performs the steps of dynamically adjusting a size of one or more of the partitions from an initial size to a different size during operation of the platform. In some embodiments, the non-transitory computer-readable medium includes a transaction buffer and when executed by the platform processor the platform operating system performs the steps of storing the blockchain transaction objects in the transaction buffer.

In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions is based on an assignment metric. In some embodiments, N of the nodes are leaders, the assignment metric is M mod N, and the assigning each of the blockchain transaction objects to the one of the partitions comprises determining a hash M of the transaction identifier of the blockchain transaction object, and determining M mod N. In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions is based on congestion levels of each of the nodes that are one of the leaders. In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions comprises determining whether the blockchain transaction object points to an existing block of the notary blockchain, disregarding results of the assignment metric if the blockchain transaction object does point to the existing block on the notary blockchain, and assigning the blockchain transaction object to the partition of the partitions in which the existing block is stored.

A fourth aspect is directed to a method of recording transactions between a plurality of users on a notary blockchain including a plurality of processing nodes, the nodes each having a blockchain memory partitioned into a plurality of horizontal partitions. The method comprises for each of the partitions, assigning a different one of the nodes as a leader for that partition with a platform server, receiving a plurality of blockchain transaction objects each including a unique transaction identifier and details of a single transaction between any two or more of the users with the platform server, assigning each of the blockchain transaction objects to one of the partitions with the platform server, and providing each of the blockchain transaction objects to the one of the nodes that is the leader of the partition that the object is assigned to with the platform server.

In some embodiments, the method further comprises each node of the nodes receiving a number of the blockchain transaction objects, and for each of the number determining whether the blockchain transaction object is assigned to the partition that the node is the leader of, determining whether the blockchain transaction object is assigned to one of the partitions that the node is a follower of, storing the blockchain transaction object on the node, sending copies of the blockchain transaction object to followers of the partition that the node is the leader of if the blockchain transaction object was determined to be assigned to the partition that the node is the leader of, in response to receiving a verification message from the platform server indicating that the blockchain transaction object is valid, locally posting the transaction object as a new block on the notary blockchain on the partition that the node is the leader of and distributing a node confirmation message to the followers of the partition that the node is the leader of indicating that the blockchain transaction object is valid, and in response to receiving a node confirmation message from another of the nodes indicating that the blockchain transaction object is valid, locally posting the transaction object as another block on the notary blockchain on the partition to which the blockchain transaction object is assigned that the node is the follower of. In some embodiments, each of the partitions are a same size. In some embodiments, at least two of the partitions are different sizes. In some embodiments, the method further comprises dynamically adjusting a size of one or more of the partitions from an initial size to a different size with the platform server.

In some embodiments, the method further comprises storing the blockchain transaction objects in the transaction buffer on the platform server. In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions is based on an assignment metric. In some embodiments, N of the nodes are leaders, the assignment metric is M mod N, and the assigning each of the blockchain transaction objects to the one of the partitions comprises determining a hash M of the transaction identifier of the blockchain transaction object, and determining M mod N. In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions is based on congestion levels of each of the nodes that are one of the leaders. In some embodiments, the assigning each of the blockchain transaction objects to the one of the partitions comprises determining whether the blockchain transaction object points to an existing block of the notary blockchain, disregarding results of the assignment metric if the blockchain transaction object does point to the existing block on the notary blockchain, and assigning the blockchain transaction object to the partition of the partitions in which the existing block is stored. In some embodiments, the method further comprises with the platform server, for each of the blockchain transaction objects provided to the one of the nodes that is the leader of the partition that the object is assigned to, providing a subsequent verification message to the one of the nodes, the verification message indicating that the blockchain transaction object provided is valid and authorized to be posted on the notary.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a blockchain transaction system according to some embodiments.

FIG. 2 illustrates a detailed view of the transaction platform according to some embodiments.

FIG. 3 illustrates a method of implementing a blockchain transaction platform according to some embodiments.

FIG. 4 illustrates a block diagram of an exemplary computing device according to some embodiments.

FIG. 5 illustrates an exemplary transaction block according to some embodiments.

FIG. 6 illustrates a method of replicating objects on a blockchain according to some embodiments.

FIG. 7 illustrates a user registration method according to some embodiments.

DETAILED DESCRIPTION OF THE INVENTION

Embodiments are directed to a transaction platform including a notary distributed ledger or blockchain and one or more separate micro-identifier chains (MIDCs) that together enable the secure effectuation and recordation of one or more transactions while maintaining transaction party confidentiality and preventing chain poisoning. The notary distributed ledgers or blockchains are able to be a single transaction blockchain to store, maintain and provide information about the parties related to the transactions which the blockchain is able to utilize in order to securely and quickly validate, execute and record the transactions. The single transaction distributed blockchain is able to be a public or private blockchain (e.g. a distributed blockchain or database across a plurality of computing devices that each store copies of transactions in one or more linked blocks) that maintains a continuously-growing list of data records hardened against tampering and revision. In particular, unlike other blockchains where a single block is used to store thousands of transactions, the single transaction blockchain of this system is able to consist of data structure blocks with each block holding only one individual transaction and/or the results of any blockchain executables. Each block of the blockchain is able to comprise a timestamp and information linking it to a previous block thereby defining the chain and maintaining an order of each of the records/transactions.

The native user data for each user is able to be stored on the micro-identifier chain. A plurality of MIDCs can be combined to form a micro-identifier chain arrays for the transaction platform. In such embodiments, for each user, only a specified single transaction block of their micro-identification chain that stores de-identified user data is able to be accessed by the notary blockchain(s) in order to form on-chain transactions. The data stored on the notary chain(s), and the other single transaction blocks of the micro-identification chain(s) is kept secure from any intruders.

Blockchain Transaction System

FIG. 1 illustrates a blockchain transaction system 100 according to some embodiments. As shown in FIG. 1, the system 100 comprises a transaction platform 102 coupled with one or more buyer devices 104 and one or more seller devices 106 over one or more networks 108. The networks 108 are able to be one or a combination of wired or wireless networks as are well known in the art. Although as shown in FIG. 1 one transaction platform 102 is coupled with two buyer devices 104 and two seller devices 106, it is understood that the system 100 is able to comprise any number of platforms 102, buyers devices 104 and/or seller devices 106 coupled together via the network 108.

FIG. 2 illustrates a detailed view of the transaction platform 102 according to some embodiments. As shown in FIG. 2, the platform comprises a platform operating system (e.g. including a plurality of separate modules and stored on/operated by one or more physical servers or the cloud) 206, one or more micro-identification chain (MIDC) arrays 204 formed by one or more a micro-identification chains 202, and at least one notary blockchain 206′ (e.g. notary blockchain cluster(s) including a plurality of nodes) all operably coupled together with the operating system 206 executing the functions described herein with and for arrays 204 and the blockchain 206′. In particular, the operating system 206 is able to comprise one or both of programming/code stored within the arrays 204 and/or blockchain 206′ and programming/code stored outside the arrays 204 and/or blockchain 206′ (e.g. within the one or more physical servers or the cloud). Further, in some embodiments the operating system 206 is able to be secure operating systems utilizing encryption in order to protect stored data. In some embodiments, the platform 102 comprises separate MIDC arrays 204 for seller MIDCs and buyer MIDCs. Alternatively, the seller and buyer MIDCs are able to be a part of the same array 204. The operating system 206, arrays 204 and the notary blockchain 206′ are able to be coupled together over the network 108 (and/or other networks).

In some embodiments, the platform 102 includes one or more side chains coupled between blockchains of the operating system 206 and/or the MIDC arrays 204. Specifically, the sidechains are able to be mechanisms that allow tokens and other digital assets from one blockchain to be securely used in a separate blockchain and then be moved back to the original blockchain if needed. In other words, the pegged sidechains are a blockchain that is attached to the parent chain (notary blockchain) through the two-way peg mechanism which allows bidirectional transfer of assets between the parent chain and the sidechain at a fixed deterministic exchange rate by using a separate token currency tied to the parent chain. In such embodiments, by using a two-way peg mechanism, the unauthorized creation of tokens and sidechains is precluded. Alternatively, the side chains are able to be omitted and/or application programming interfaces (APIs) may be used by the system to effectuate inter-chain and/or inter-ledger operability.

The notary blockchain 206′ is able to be a public/private hybrid blockchain (or a public blockchain or a private permissioned blockchain). For example, the blocks of the blockchain 206′ are able to only be viewed by a permissioned user (e.g. having a valid account on the system 100 using the encoder/decoder/view module “Rosetta” described below). The each of the blocks of the blockchain 206′ are able to store a single transaction between one or more users (e.g. a seller and a buyer) and indicate the details of the transaction (as described below) including identifiers of the MIDCs 202 of the users that are a party to the transaction. In some embodiments, a single transaction block is created on the notary chain 206′ for pending transactions (e.g. pending transaction blocks) and then a subsequent single transaction block is created when/if the transactions are completed (e.g. completed transaction blocks).

In some embodiments, the notary blockchain 206′ is plasma network blockchain and smart contract platforms featuring on-chain, off-chain and/or cross-chain atomic swaps, lightning network functionality, two-way pegged sidechains and/or instant payments. In some embodiments, the system uses (e.g. native) smart contracts which are automated smart contracts each containing a set of rules under which the advertiser, the platform and the user have already agreed that when the rules are met, the agreement is automatically enforced. Specifically, the smart contract code facilitates, verifies and enforces the performance of that agreement and results in a transaction, and smart contract, that is saved to the notary blockchain 206′ and/or the MIDCs 202 of the associated buyers/sellers, where proportional pre-determined amounts from the proceeds of the transaction (as specified in the contract) are directed to the user, the platform and/or other entities. Alternatively, one or more of the notary blocks are able to not include smart contracts (e.g. be just data blocks).

FIG. 5 illustrates an exemplary notary blockchain 206′ and/or MIDC 202 transaction block 500 according to some embodiments. As shown in FIG. 5, the single transaction block 500 comprises a block header 502 including a block number, a time of creation, a block height, a block type value and/or other values. Types of single transaction blocks found on the notary blockchain 206′ and/or MIDCs 202 include, but are not limited to, genesis PPI blocks, updates to PPI blocks, pending transaction blocks, completed transaction blocks, pending dispute blocks, completed dispute blocks and/or other types of blocks. Each of the types are able to have a different corresponding type code such that the value of the type code in the header 502 of the block indicates what type of block it is. As further shown in FIG. 5, the block 500 is also able to comprise a hash 504 of the header of the previous block in the chain, a merkle root value 506 and block type-specific data 508. Specifically, because the block 500 shown in FIG. 5 is a transaction block, the block type-specific data 508 is able to comprise one or more sender/seller identifiers, one or more receiver/buyer identifiers and metadata describing the parameters of the transaction (e.g. product description, price, time and/or other transaction parameters as described herein). For other block types, the block type-specific data 508 is able to comprise different information such as transaction/transaction block identifiers for pending/completed dispute blocks, dispute resolution transaction parameter changes for completed dispute blocks, updated or new user identification data and/or PPI for genesis blocks and/or PPI update blocks, and other types of data discussed herein.

The operating system 206 (and/or the devices 104, 106 if the application is downloadable) include a transaction application that enables the hardware of the operating system 206 (and/or the devices 104, 106) to perform the functions of the system 100 described herein. In some embodiments, the operating system 206 implements the application as a transaction website and/or includes a downloadable transaction application that users are able to visit (e.g. via a web browser) and/or download onto their devices 104, 106 in order to access the features (e.g. modules) of the operating system 206 described below. Specifically, the website and/or downloadable application are able to provide a user interface for receiving and responding to commands/request/input from users and communicating that data to the operating system 206 via the networks 108.

It is understood that although for the sake of brevity the discussion herein describes an exemplary distribution of performance the functions of the system 100 between the operating system 206 and/or the application downloaded onto the devices 104, 106, it is understood that other function distributions between the application and operating system are contemplated including omission of the application such that the operating system performs all functions (e.g. with user interface functions being provided via a website). Additionally, in some embodiments the system is used to effectuate cross-chain transactions and/or cross chain ledger transactions.

The MIDC arrays 204, also referred to as a Chain Arrayed Data Store, are able to comprise one or more stacked MIDCs 202 such that the blocks of the MIDCs 202 are each a cell of the array with each MIDC 202 being a row of the array and the aligned cells of different rows forming the columns of the array 204. Each MIDC 202 (and thus each row) of the array 204 is dedicated to personal information about a single user/account, wherein any additional information or changes in information being reflected in additional blocks appended to the end of the MIDC 202 for that user/account. Accordingly, each MIDC 202 only ever represents one user and is the blockchain equivalent of all their data on a database. In some embodiments, each MIDC 202 comprises identification data (e.g. name) and personal data (PPI) (e.g. username/password, security questions/answers, age, image, voice, gender, and/or other data associated with the user/account) associated with each other in their native format, a unique identifier assigned to the user/account/seller/buyer by the system 100 (e.g. alpha-numeric string), and de-identified data (e.g. an encrypted form of the unique identifier and the PPI).

As described in detail below, when a user registers with the system 100 (e.g. through the API gateway via a website, application, or other front-end user interface), their native identification and PPI and other data such as biometric are captured, a new MIDC is created for this new user/account and a unique identifier is assigned to the user/account. This native identification and PPI data or other user data such a biometrics is then placed in a read-restricted “genesis” block on their MIDC 202. The PPI data and the unique identifier are then able to be encrypted by the system forming “de-identified” PPI. The de-identified PPI is then able to be placed in a new block on the MIDC 202 (appended to the genesis block) that is able to be read by the operating system 206 for use by the notary chain 206. In some embodiments, any subsequent updates to the user identification and/or PPI are able to be incorporated with the existing data and incorporated into a new block on their MIDC 202 (and a subsequent de-identified version). In such embodiments, the previous, now outdated, genesis blocks become inaccessible (e.g. read restricted) as their data is now inaccurate. At no point is the notary chain 206 able to access the genesis block including the user PPI in its native form and thus the native form of this data is never posted or otherwise added to any of the transactions recorded on the notary blockchain 206′.

The new MIDC 202 is able to be stacked with any pre-existing MIDCs 202 (of other users/accounts) in order to form the MIDC array 204, which becomes the equivalent of, and is able to fully emulate the functionality of an off-chain server-based database, without their inherent security vulnerabilities. As described above, any new or updates to the PPI of the user/account are added as a new block (that is not readable by the notary chain 206′) on the user's MIDC 202 and then this new/updated PPI is encrypted with the unique identifier to create another “de-identified” block that is added to the end of the MIDC 202 of that user/account as a new block reflecting the new data/changes (and being readable by the notary chain 206′). In this manner the notary chain 206′ is only ever able to access/read the latest block in a user's MIDC 202 which will only contain de-identified data enabling the GDPR, as well as global data privacy law compliance and security described herein.

The notary blockchain 206′ is able to be a node cluster of a plurality of processing nodes (e.g. servers, computing device, or other computing elements) implementing a proof of transaction consensus protocol (as described below) and a partitioned RAFT (P-RAFT) replication protocol, which is able to be implemented by the notary module as operating on each of the nodes, on a system server separate from the nodes, or both. Specifically, each node within the cluster is able to be a P-RAFT leader for a logical horizontal partition of the blockchain 206′ and push/replicate its log (e.g. blockchain ledger of transactions) for that logical partition to a set number of the other nodes. Accordingly, each node is sent objects (e.g. pending/completed transaction objects, PPI objects, pending/completed dispute objects) for its given partition for which they are the only P-RAFT leader. The objects are able to originate from user devices 102, 104, servers 206 and/or other elements within the system 100. As a result, each of the nodes of the cluster are able to be both P-RAFT leaders of their partition as well as P-RAFT followers for other partitions.

When the node cluster boots up, all nodes participate in voting to determine an “orchestrator” node. The notary module of this orchestrator node then assigns each of the nodes to one or more of the partitions. Once determined, the partitioning schema indicating the partitions assignments of each of the nodes is replicated across every node in the cluster so that if the orchestrator node goes offline the partitioning schema is maintained and a new orchestrator node is elected. This orchestrator is able to reassign nodes to different sets of partitions as necessary to rebalance the partitions. A node may be assigned to one or more partitions by the orchestrator node. The precise number of partitions to which a node is assigned is configurable (this is the replication factor). Nodes assigned to the same partition elect a leader node for that partition. Alternatively, the notary module of the orchestrator node selects a leader for each partition based on a rotating scheme. The number of nodes in each partition is able to be dynamically adjusted by the orchestrator node.

There can only be one leader for any partitions. In the single fill partition mode, all other nodes are followers to the single leader. In the multi-fill mode, for each of a plurality of partition/leader node pairs, all other nodes are followers. A node may simultaneously be a leader for a particular partition and a follower in another partition in multi-fill mode. Nodes are best configured to be able to only lead one partition at a time (but each node is able to be a follower for more than one partition). While this is the most efficient configuration, the configuration of leader to followers is configurable. For example, the configuration in a Partitioned Cluster can be configured to be more efficient by changing certain parameters like the Replication Factor.

The Replication Factor is the number of nodes that will participate in a partition (only one of which may be the leader). The partitions per node count is a separate parameter which configures the number of partitions a single node may participate in (in some embodiments, it is ensured any given node only leads one partition at a time). For example, in a cluster of 50 nodes with a replication factor of 5 and a partitions/node setting of 1, the cluster will support a maximum of 10 partitions (for every 5 nodes, only one may lead a partition).

Alternatively, in the same cluster of 50 with a replication factor of 5, if the partitions/node setting is changed to 3, the cluster will support 30 partitions. For every 5 nodes, three may act as a leader (but not for the same partition) because each node will be assigned to 3 partitions. For each of the 3 partitions a node is part of, the node will participate in elections and may become a leader (unless it is already leading a partition). For example, if Node A is leading Partition 1 and following Partition 2 and 3, and the leader of Partition 2 goes offline, Node A will not submit itself as a candidate for election but will still respond to other requests for votes among other nodes in Partition 2. The foregoing applies to the Notary Chain(s). To clarify, for the MIDCs, each node must be, and is, able to “lead” more than one MIDC, so as to not require a Node for every MIDC. For the MIDCs, the prior structure discussed above is the same except that each “partition” for MIDCs is actually a fraction of total MIDCs instead of an individual MIDC. The underlying file storage for MIDCs still remains separate for deletions.

Leader and follower functions remain intact across single and multi-fill iterations modes. Leaders are changed based on a system algorithm like in RAFT. If a leader goes “offline” a new leader is automatically substituted, as if there was a “normal” leader rotation and like in RAFT, the consensus continues. Objects/transactions for that partition are not sent to any other node, and objects are delivered to the partition leader at least once.

As the objects are received (e.g. from user devices 104, 106, from other system elements described herein) at a central receiving server, they are able to be stored/buffered in a memory pool or buffer of the central receiving server. In some embodiments, the buffer is a first in first out (FIFO) buffer. Alternatively, one or more of the objects are able to be prioritized for assignment over other objects. For example, objects relating to pending and completed transactions (e.g. between a buyer and a seller) are able to be prioritized over pending and completed dispute objects and/or PPI objects, or vice versa.

Subsequently, the notary module is able to assign each of the buffered objects to one of the partitions and distribute that object to the leader node of that partition for recording on the designated partition as a block. In some embodiments, the notary module assigns sequential objects to the same one partition until such time as that partition is full, and then the next empty partition is filled until complete and so on. Alternatively, the notary is able to assign the objects to multiple different partitions in parallel, filling the partitions simultaneously and at possibly different rates. In such embodiments, an object partition distribution metric is able to be used by the module to assign received objects to one of the partitions. In some embodiments, the central receiving server is one or more of the nodes of the blockchain 206′ (and/or MIDC 202). Alternatively, the central receiving server is able to be one or more of the servers storing the platform operating system 206.

For example, in some embodiments the assigned partition is determined by finding the modulus of a hash of an identifier (e.g. assigned partition=hash(object identifier) % number of available partitions) of the object (e.g. the public key, private key, object/transaction identifier, other data of the object/transaction as described herein, and/or a combination thereof such as a concatenation of two or more of the values). Alternatively or in combination, other object partition distribution/assignment methods are able to be used such as assigning objects based on a fullness level of each of the partitions (e.g. assigning to the least full) and/or a number of pending objects that are waiting to be added to the partitions (e.g. refraining from assigning to a partition if a number of pending objects meets a threshold level). In some embodiments, if an object references a specific prior block/object (e.g. a completed transaction object referencing a previously recorded pending transaction object), the object is able to be routed to the leader node for the partition storing that block/object even if applying the distribution metric to the object would have assigned a different partition for the object.

In response to receiving an object assigned to a partition that they lead, the nodes store the object locally and push/replicate it to a configurable number of the other “follower” nodes in the cluster (e.g. all or a subset of the other nodes). Upon receiving confirmation that the object is verified (e.g. when the node has determined that the objects are not poisoned and/or that the objects are valid based on the proof of transaction consensus described herein), the nodes add the object as a block to the assigned partition locally and broadcast a confirmation to those follower nodes indicating for them to also add the objects as a block to their copy of the assigned partition locally. Thus, each node receive, share, confirm and record objects as blocks for partitions for which they are a leader, while concurrently receiving shared objects, receiving object confirmations, and locally recording confirmed objects on partitions for which they are a follower. In some embodiments, each of the nodes maintain the persistence layer (e.g. direct to attached disk volume) for “their copy” of the partitions they both lead and follow. In some embodiments, each of the leader and/or follower nodes process each received object in an idempotent manner

The size and scope of the partitions are able to be determined by the notary module autonomously. For example, the blockchain 206′ (e.g. the memory of the nodes storing the blockchain) is able to be pre-sharded in equal sized logical partitions by default. Alternatively or in addition, the size and scope of the logical partitions are able to be dynamically adjusted and/or manually input by a user. In some embodiments, the notary module is able to dynamically adjust the size and/or quantity of the partitions based on the load of each partition (and the associated nodes) to prevent transactional and computational overload. However, because the system can dynamically horizontally scaled by adding computing resources, dynamic addition of computing resources is the preferred methodology to adjust for spike in object processing needs, As a result, this partitioned P-RAFT notary and replication provided the benefit of distributing the notary and replication workload thereby increasing object speed while still providing object security. Although described above with respect to the notary blockchain 206′ for the sake of brevity, the above features are able to equally apply to the MIDCs 202 implemented by the notary module and/or other modules of the operating system.

FIG. 6 illustrates a partitioned RAFT method of replicating object/transactions on a blockchain 206′, 202 according to some embodiments. As shown in FIG. 6, for each of the partitions, the platform operating system (as executed by the platform server(s)) 206 assigns a different one of the nodes as a leader for that partition at the step 602. The platform operating system 206 receives a plurality of objects each including a unique transaction identifier and details of a single transaction between any two or more of the users at the step 604. The platform operating system 206 assigns each of the objects to one of the partitions at the step 606. The platform operating system 206 provides each of the objects to the nodes that lead the partition that the object is assigned to at the step 608.

In some embodiments, the method further comprises each node of the nodes receiving a number of the objects (e.g. from the operating system 206 and/or other nodes), and for each of the number, determining whether the object is assigned to the partition that the node is the leader of or a follower of. If the node is the leader of the partition, the node stores the object and sends copies of the object to the followers of that partition. Subsequently, upon receiving confirmation in a verification message (e.g. from the operating system 206) that the object is authentic (e.g. consensus successful for the object, no poisoning found in the object, object properly formatted), the node locally posts the transaction object as a new block on the notary and/or MIDC blockchain on the partition that the node leads and distributes a confirmation message to the followers of the partition that indicates that the object is valid. In contrast, if no verification message is received after a predetermined period and/or the verification message indicates that the object is not authenticated (e.g. consensus unsuccessful for the object, poisoning found in the object, object improperly formatted), the node locally deletes the transaction object and distributes a confirmation message to the followers of the partition that indicates that the object is invalid. Alternatively, the node is able to omit sending a confirmation message to the followers if either no verification message is received after a predetermined period and/or the verification message indicates that the object is not authenticated and the follower nodes automatically delete the object locally after not receiving a confirmation message within a predetermined period.

If the node is a follower of the partition, in response to receiving a node confirmation message from another of the nodes indicating that the object is valid, locally posting the object as a block on the notary and/or MIDC blockchain on the partition to which the object is assigned. Additionally, as described above, if the node is a follower of the partition, in response to not receiving a node confirmation message for the object within a predefined period or receiving a node confirmation message indicating that the object is not authenticated, locally deleting the object. In some embodiments, the method further comprises the operating system 206 dynamically adjusting a size of one or more of the partitions from an initial size to a different size. In some embodiments, the method further comprises the operating system 206 storing the objects in the transaction buffer before assigning them to a partition and sending them to one of the nodes.

In some embodiments, the assigning each of the objects to the one of the partitions comprises determining a hash M of the transaction identifier of the object and determining M mod N, where N is the number of leader nodes. In some embodiments, the assigning each of the objects to one of the partitions is based on congestion levels of each of the nodes that are one of the leaders. In some embodiments, the assigning each of the objects to one of the partitions comprises disregarding results of the assignment metric if the object points to an existing block on the blockchain and assigning the object to the partition in which that block is stored. In some embodiments, for each of the objects provided to a leader node, the operating system provides a subsequent verification message to the leader node indicating that the object provided is authenticated or not as described above.

Operating System

The operating system 206 is able to comprise a registration module, a key module, a notary module, a biometric module, an authentication module (“Rosetta”), a block loader module, a privacy law and regulatory law compliance module, a sales module, a purchase module, an anti-poisoning module, a payment processing module, a ledger module, a security module and a dispute module. Alternatively, more or less modules (and/or micro-services) are able to be used and/or one or more of the modules and/or micro-services (and their associated functions) are able to be combined or divided. Module is interchangeable with “micro-service” herein.

Registration Module

The registration module enables a user (i.e. buyer/seller) to create an account on the transaction system 100 by inputting private personal information (PPI) such username and password information, a native identifier (e.g. name), personal information about the user, contact information (e.g. phone number, email), privacy regulation compliance metadata (e.g. age, current location, privacy preferences) and/or banking information via a graphical user interface (e.g. of a website and/or transaction application). In some embodiments, the personal information includes biometric data (iris scan, voice recording, fingerprint scan, facial scan, blood type, other biological characteristics or any combination of the foregoing) for implementing biometric verification. In some embodiments, this biometric data is also used to enable access to the platform, or for access to transactionality or protected function on the platform. For example, the platform is able to implement a biometric login and registration and subsequent access restriction as described in U.S. patent application Ser. No. XX/XXX,XXX, filed Sep. 18, 2020, and entitled “DYNAMIC BIOMETRIC IDENTITY VERIFICATION SYSTEM, METHOD AND DEVICE,” which is hereby incorporated by reference. Alternatively, the biometric login and registration and access use is able to be omitted and/or other biometric access methods are able to be used.

In some embodiments, the personal information is able to be omitted for a user that is a seller. This account information is then associated with a newly generated account and stored on a new MIDC 202 for the user along with a platform-generated unique identifier (as described above) such that the information is able to be used to identify the user when logging onto the platform 102 and other functions of the platform 102. The personal information is able to comprise one or more of the account owner's age, gender, address, income level, religion, political affiliation, race, nationality, interests, height, hair color, eye color, weight, medical conditions, family members, education level, degrees earned, occupation, passport number, driver's license number, IP address, device identifier, work address, work phone number, banking account number, social security number, date of birth and/or other characteristics of the user. After the account is created, the user is able to access the account and any associated data (e.g. to edit the personal data) by entering the username and biometric data and/or a password in order to identify themselves to the system 100.

FIG. 7 illustrates a user registration method according to some embodiments. As shown in FIG. 7, the registration module provides a user interface requesting PPI for establishing a new account at the step 702. The PPI requested is able to include identification information (e.g. name, username), password information, personal information about the user, contact information (e.g. phone number, email) and/or banking information. The registration module inputs the PPI and creates an authentication hash and a key hash of the entered password at the step 704. The registration module is then able to add authentication salt to the authentication hash and key salt to the key hash at the step 706. The registration module stores (e.g. in the vault) the authentication hash, authentication salt and other encryption parameters at the step 708. The registration module stores the key salt and the other encryption parameters (e.g. in the vault), but not the key hash at the step 710. The registration module generates an original ephemeral encryption (EC) key for the new account/user using the key hash as the seed at the step 712. The registration module digitally signs a genesis transaction using the password and generates a new MIDC 202 with the first single transaction block being the genesis transaction at the step 714. This MIDC 202 is then able to store transaction associated with the user and thus be the user's personal MIDC 202. In some embodiments, a message indicating the creation of this new MIDC 202 is able to be transmitted to the notary module, which is able to record a transaction identifying the creation of the new MIDC (using an alias to identify the user/account such as an alphanumeric string).

After creation of the genesis block, the registration module generates one or more additional single transaction blocks on the MIDC 202 at the step 716. These additional blocks are able to include a PPI transaction including the PPI submitted by the user, a password recovery transaction including password recovery information (e.g. security question data) and/or a biometric data transaction including biometric data of the user (e.g. inputted using a biometric login/registration as described above). The registration module is then able to indicate the successful creation of the account/MIDC to the user via the graphical user interface at the step 718. In some embodiments, upon completion of the registration the registration module is able to generate (and/or request/input from a vault described below) a JSON web token (JWT), sign the JWT with the user's ephemeral EC (private) key, and transmit the signed JWT to the user device to authorize the user device's session on the platform.

After the registration process has been completed, a user/device is able to subsequently log into the platform 102 by submitting their password as a part of a login request. In response, the registration module submits an authentication verification request with the password to the key module, which retrieves the password salt, encryption parameters and authentication hash for the user. The key module is then able to use the parameters (e.g. argon2id parameters) and salt to recalculate the authentication hash based on the submitted password and compare the produced value to the stored hash value for that user/account (determined during the registration process). If the values do not match, the registration module issues a failure message to the user. If the values do match, the registration module signs, issues a JWT, and transmits the token to the user/user device which the device is able to use to access the platform 102. In some embodiments, the registration module is implemented by an application program interface (API) gateway within the platform 102.

Key Management

The key module enables generating and storing of keys and other types of secrets (e.g. unique identifiers) for use with the platform 102. Once a user has entered their PPI and created an account on the platform 102, the key module generates a unique identifier for that user/account (e.g. alpha-numeric identifier) and user/MIDC keys and/or ephemeral keys for that user/account/MIDC that are used to sign transactions, encrypt/view data on the MIDC 202 and sign on to the platform 102. Subsequently, the module encrypts both the unique identifier and the PPI associated with the account and stores it on a block added to the genesis block of the MIDC 202 for that user. As described above, unlike the protected genesis block (including the native PPI and unique identifier) this added block (e.g. the latest block) of the MIDC 202 is able to be accessed by the notary blockchain 206′ and/or notary module of the operating system 206 in order to sign/record transactions on the platform 102. In some embodiments, the key module utilizes user passwords (e.g. inputted during registration) with/or without biometric data in order to derive the encryption and signing keys for the user's MIDC 202 and PPI. In some embodiments, the passwords are hashed using the argon2 ID algorithm. For example, in some embodiments the user keys for the MIDCs 202 are deterministically and ephemerally generated by the key module when needed based on both a cryptographically secure hash of the user's password and a secret cryptographic salt. The parameters necessary to derive the MIDC key pair are able to be stored in an MIDC vault that is able to be separate from or a part of the arrays 204. This MIDC key is only used to sign MIDC transactions on behalf of the user and is not compatible with the notary blockchain 206′. In some embodiments, the key module inserts a secret identifier (e.g. zero-watermark) into the MIDC key pairs. As a result, the key module is able to look for the secret identifier in any a public/private key that a device/user is attempting to use and determine if the key is fraudulent if it does not contain the secret identifier.

The MIDC keys are able to be used by the buyers/sellers and/or the notary blockchain 206′ to log onto the platform 102 as well as to digitally sign transactions/smart contracts in order to effectuate the transactions on the platform 102. In other words, the public key of this pair (the user's “Pubkey”) is the user's primary visible identifier within the platform 102, and is also used to encrypt data that only they should be able to read. The private key of the pair is used to sign their MIDC transactions (most user operations) and to sign their JWT to begin authenticated web sessions. Further as described above, in some embodiments the user private keys are not persistently stored by the platform 102. Instead, they are ephemeral and/or regenerated each time they are required using the user's password (and salt and/or other derivation factors). In some embodiments, user keys use Elliptic Curve P256-NIST cryptography.

Like for the user MIDCs 202, the key module is also able to generate notary key pairs for use by the notary blockchain 206 and/or the notary module of the operating system 206 in order to sign transactions and perform other functions. The notary keys are generated and stored in a vault implemented by a MIDC array 204 (e.g. MIDC vault) that the notary chain 206 must query when the keys are needed for signing transactions or other functions. The notary blockchain keys are able to be generated within the MIDC vault by the key module and may not be exported. The notary module is the only module within the cluster permitted to execute operations with these keys (e.g. sign, encrypt, decrypt, etc.). As a result, the notary private keys are never known or accessible by the system. In some embodiments, the vault is operated by a hardware security module (HSM) operating a vault gateway. Alternatively, the vault and vault gateway are able to be operated without an HSM.

In some embodiments, if the notary module needs to sign transactions that go onto the MIDCs 202 (e.g. records of transactions that have been committed to the notary blockchain 206′ and need to also be reflected on the seller/buyer MIDCs 202), the key module is able to issue one-time-use keys for the primary MIDC signature and also require an additional signature with the notary key to ensure the transactions are validated by the notary module itself. In some embodiments, the MIDCs utilize 256-bit EC keys and the notary uses 384-bit keys. Alternatively, other key sizes are able to be used. In some embodiments, the notary keys are intentionally made to be inoperable with the MIDC keys (e.g. using a P384 elliptic curve) thereby providing an added layer of security.

In some embodiments, during login and registration establishing initial PPI and/or any time a user wishes to add new PPI, a copy of data needed for account recovery is added to their MIDC 202 using a key deterministically derived from an enrolled recovery method (e.g. a hash of a known private secret combined with an un-stored user identifier generated during voice biometric enrollment). When a user wants to recover their account or reset their password, the biometric module (sometimes referred to as the biometric lock) and/or other alternate identification method (e.g. security questions, two-way verification, or other methods), re-identifies the user (e.g. using voice and/or facial identification methods with/or without proof of liveness AI assisted questions that work with the users biometrics) and returns the same identifier used when the user first enrolled (e.g. voice data, facial image data, security question data and/or other data). The original key pair is then re-calculated and used to execute an account recover smart contract on the original MIDC 202 of that user, migrating the data from that MIDC 202 to a new MIDC 202 with a genesis block created by the user's new password.

In some embodiments, the platform 100 is able to comprise multiple parallel operating instances. In such embodiments, within an instance, a user's/account's public key is representative of their identity because it also represents their entire MIDC 202 including the stored PPI, account recovery data (e.g. smart contract) as well as MIDC vault storage of related secrets, authentication data and compliance metadata. Within a platform instance that supports multiple notary modules and/or notary blockchains (e.g. instances that share MIDC arrays), the same applies. However, for isolated instances with separate dedicated notary blockchains/modules and MIDC arrays 204, the MIDC vault key derivation parameters are able to be shared between instances allowing the user/account to authenticate using the same credentials (e.g. password) on any of the instances while the PPI of the user/account would still be specific to each instance. To keep the MIDC vaults isolated, in some embodiments credentials and keys would be entirely separate (e.g. such that the user/account could have different passwords on one instance verses another). If biometric-based account recovery is used, that user/account is able to recover their account on any instance regardless of which data is on which instance.

Secure Data Viewing

The authentication module (“Rosetta”) enables users to encode/decode and/or read data on the MIDCs 202 in order to access information about their own data, their transactions and/or the other parties to the transactions (while it remains on the user's MIDC 202). Specifically, when it is needed, Rosetta acts as a “decoder” to temporarily allow an appropriate system approved user (subject to certain rules and permissions) to temporarily view that PPI for approved purposes (i.e., accounting, shipping, verification, etc.). The PII is never moved off the user's MIDC 202. Rosetta allows it to always stay there. No personal data exists anywhere on Rosetta other than the MIDC 202 where it resides. As described herein, the notary blockchain 206′ uses an encrypted, substituted and anonymized/pseudo anonymized identification data and unique identifiers for buyers and sellers. These identifiers on the notary blockchain 206′ act as pointers for Rosetta to locate the relevant “Buyer” and/or “Seller” identifiers for a transaction, so Rosetta can allow an authorized user to see that PPI, after Rosetta locates and decodes it from the MIDC 202 of those identified/pointed to buyers/sellers. Additionally, Rosetta is able to authenticate and authorize user sessions for the platform 102, sign user transactions, tokenize data for PPI searches, create permissioned copies of PPI for parties authorized to access it by users during the course of transaction execution, re-encrypted with the receiving party's key, set up and manage stenographic pipelines for important flows like registration and login and/or other authentication functions.

Additionally, if a user wishes to view data stored on another user's MIDC 202 (e.g. from a previous transaction between the users), Rosetta is able to securely provide access to view that data (assuming the user has authority to view that data). For example, if a first user 23 (that has been authenticated) issues a request to Rosetta to view data (e.g. a specified transaction) of a second user 25, Rosetta parses the request for the user 23 password and the target MIDC, user and/or transaction identified in the request. Rosetta is then able to generate a certificate (e.g. public key infrastructure key) using the user 23 password and/or other data (e.g. user password, salt, other parameters and/or hashes thereof) and send the certificate to the key module in a request for the key derivation parameters for user 23 stored on the platform 102 (e.g. on the MIDC vault controlled by the key module or elsewhere on the platform 102). If the certificate is authentic (e.g. the password and other parameters used to generate the certificate were correct), the key module retrieves and transmits the user 23 key derivation parameters to Rosetta which is able to user the received key derivation parameters (e.g. along with the user password and salt) with a key derivation function (e.g. Argon2) to derive a key seed. Rosetta is then able to use the key seed to dynamically generate the user 23's key pair using the same key generation function that was used by the key module to originally generate user 23's key pair (e.g. EC256).

Further, Rosetta is able to retrieve the MIDC block of user 25's MIDC 202 including the data that user 23 is permitted to view (e.g. the transaction including user and/or identified within the initial request). In particular, the target block of user 25's MIDC is able to be encrypted using the public key of user 23 and then decrypted by Rosetta using user 23's dynamically regenerated private key. Accordingly, Rosetta is then able to present the data to user 23 (e.g. in memory only through secure data channel) for view via the graphical user interface of the platform 102 (e.g. application, browser/website, and/or other graphical user interfaces). In some embodiments, even after decryption the data is scrambled such that Rosetta further needs to descramble the text using a descrambling algorithm before it is presented to user 23. Therefore, Rosetta provides the advantage of enabling authenticated users to view data on other user's MIDCs 202 while still maintaining data security.

Database Importing

The block loader module enables a user to load an existing database into the MIDC array 204 to simplify, and automate, user migration from a DBMS to the transaction platform 102. Since the MIDCs 202 of the platform 102 use single transaction blocks for each transaction and/or dataset, each block of an MIDC 202 is the functional equivalent to a “cell” in a database such that the entire chain of the MIDC 202 is the functional equivalent to a separate row in the database and the blocks that align between the MIDCs 202 when they are stacked on top of each other (in the array 204) are the functional equivalent to a separate column in the database. Thus, the stack of MIDCs 202 of separate users forming the MIDC array 204 of the platform 102 is able to form a functional equivalent of a database with columns and rows.

Because of this MIDC array 204 structure (e.g. stacked MIDCs each dedicated to a separate user), the MIDC array 204 is searchable and has create, read, update and delete functionality like a database. The delete functionality is achieved by deleting the entire MIDC 202 like deleting an entire row of a database (and replacing it with a new MIDC 202 if desired such as for user password/account reset). Append is able to be achieved by creating additional single transaction blocks for the associated chain 202 with additional data reflecting the new/updated data (wherein the authentication module Rosetta is structured to look for the block in an MIDC with the “latest” data whether it is a block containing a revised address or other PPI for a user, or a block in a series of blocks for a particular transaction that might show a shipping change or dispute resolution for example).

As a result of the MIDC array 204 structure, the block loader module is able to migrate the cells, rows and columns of databases to the functional equivalent blocks, chains and aligned blocks in stacks of chains of the MIDC array 204. Thus, the block loader module is able to effectuate a migration of an existing database to the platform 102 while preserving the structure and data of the original database it was on. In some embodiments, the block loader is able to automate this migration and utilize a cloud-based structure to achieve this migration.

Privacy Law and Regulatory Law Compliance

The privacy compliance module automates and maintains data privacy law and regulatory law compliance functions, so that data on the system—from original collection, through storage, curation, retention and deletion—is done in such a way that the data is always in compliance with all global data privacy laws and regulatory laws (e.g. health insurance portability and accountability act (HIPAA), financial industry regulatory authority (FINRA), securities and exchange commission (SEC), know your customer (KYC), anti-money laundering (AML), etc.). First, all global data privacy laws and regulatory laws, be they county, state/provincial or category specific (e.g. general data protection regulation (GDPR), California consumer privacy act (CCPA), federal information security modernization act (FISMA), health insurance portability and accountability act (HIPAA), payment card industry (PCI)) are broken down and loaded as rules into the privacy compliance module engine and/or stored in a compliance memory of the system 100. Second, each time user data (e.g. PPI) is added to the platform 102, the module uses geolocation functions (e.g. upon user registration and/or log on to the system) to determine their location and access the associated stored privacy rules based on the determined location. Third, the module applies the identified rules to the data. In some embodiments, the rules are automatically periodically updated and adjusted to changes in the law such that they always apply the most up to date rules to each set of data on the platform 102. In some embodiments, the privacy compliance module uses AI/Machine Learning to assist in the application of the aforementioned rules, along with geo-locating all users, at all times to automate data privacy law compliance. In such embodiments, the compliance memory is able to also store a knowledge base for applying the loaded rules to the users using the AI/machine learning.

For example, if the platform 102 is deployed by a medical office in Los Angeles, Calif. and after January of 2020 the compliance module sees a user on-board to the platform 102, the privacy compliance module applies the appropriate data privacy law rules to that user's data (e.g. PPI) including; but not limited to: CCPA+HIPPA+PCI which are all applicable for that location. As another example, if the platform 102 is deployed for a hotel chain and the user originally on-boarded in London where the privacy law and regulatory law compliance module/engine applied GDPR+PCI and any other relevant and appropriate data privacy laws to the user's data for that location. That user then travels to Beijing and checks into a hotel chain's property there. Because the privacy law and regulatory law compliance module geo-locates the user for each and every transaction that they make on the platform 102, it will automatically determine the new location and additionally apply Chinese data protection and regulatory law and any other Chinese law governing the transfer of data to jurisdictions outside the territorial boundaries of China. As a result, the privacy law and regulatory law compliance module/engine provides the benefit of automating compliance with data privacy law and regulatory laws even when involving multiple jurisdictions and types of laws.

This functionality applies to users electing to enforce their Right of Erasure as well. While users have the unfettered right to erase their data, most times that erasure is not immediate. Global data privacy laws have exceptionalities of holdbacks that allow companies to not immediately erase a user's data even after they have enacted their Right to Erasure. A sample of reasons for such delaying of erasure include provision in global data laws for: credit care charge-back periods, to comply with tax laws, or for contract reasons, public interest, research, etc. all with different allowable tolling periods.

As a result, the privacy compliance module also enables a user/entity operating the platform 102 to select any of the erasure delaying provisions that apply to them and the module will then automatically implement those delays (e.g. start a timer or otherwise monitor when in the future the data should be erased and then effectuating the erasure at that time after the appropriate delay period has elapsed). In particular, when a user elects to exercise their right of erasure of their stored PPI, the privacy compliance module automatically:

1. Transmits a message to the user indicating that they system has time-stamped their erasure request.

2. Transmits a message to the user indicating any legal tolling/delays that apply to their requested right of erasure.

3. Sets a clock or other timing function, based on the user time-stamped deletion request, as to when deletion is to be made upon the expiration of said tolling period.

4. When that tolling period expires, effectuates the user's Right to Erasure request by deleting that users MIDC 202 and notifies the user that their data has been removed from the system.

Finally, in the unlikely event of a breach of the system (or any event resulting in disclosure of some or all of one or more user's PPI) the privacy compliance module will, taking into account the applicable data privacy law (based on the user(s) and their location), automate and effectuate the reporting of said breach to both users and the appropriate regulatory agency(s). Thus, the platform 102 provides the benefit of being autonomously, and in real-time, with zero-trust, being compliant with GDPR, CCPA and other all data privacy laws while maintaining the benefits of the blockchains immutability.

Transactions

The sales and transaction module/engine enables a user/seller to input product and/or service information (e.g. description, price, delivery options and other product/service details) that the seller wishes to provide for sale on the platform 102. In some embodiments, the sales module provides a unique identifier for each of the products/services. Upon submission of the product/service information, the sales module generates a smart contract that reflects the indicated parameters of the sale of the product/service along with the encrypted seller unique identifier and/or the product/service identifier. The sales module then adds this smart contract and the identifier(s) as a single transaction block for each product/service on the seller MIDC 202. Alternatively, the product/service transaction blocks are able to be stored in a different location such as a different MIDC array 204 and/or other type of memory. Again, because the native user identifiers are not used, the information stored on these product/service blocks of the seller/buyer MIDCs 202 is fully de-identified (fully encrypted, pseudo anonymized and anonymized) such that it is not connectable to any natural user identification information.

The purchase module enables a user to view and purchase one or more of a list of products and/or services that have been provided for purchase by the sellers via a smart contract on a block on the seller's MIDC 202 on the platform 102. Specifically, the products and/or services presented are able to reflect the terms of the open smart contracts for the products and/or services created by the sellers and stored on the seller MIDC 202 such that the buyers are able to choose whether they agree to those terms and to complete the smart contract.

Once a buyer selects one or more products of a seller and submits a purchase command to the purchase module (e.g. via a buyer device 104), the purchase module checks the buyer and seller credentials by accessing the buyer's MIDC 202 and the seller's MIDC 202 to determine if they are in good standing, meaning they have been determined to not be a user that has engaged in fraudulent transactions or one that has been flagged and or removed from the system for malevolent behavior such as trying to either chain-poison the system or compromise the cybersecurity of the system. If the credentials for both the buyer and the seller are able to be verified/authenticated, the purchase module generates a pending transaction object for the buyer and the seller.

In some embodiments, generating the pending transaction objects is able to comprise requesting the password authentication hash and/or the private key derivation parameters (e.g. as stored on the vault) from the key module. The key module determines if the purchase module's context permits reading of the authentication hash and/or key derivation parameters, and if so, retrieves them from the vault. With these values, the purchase module computes the authentication hash of the user/buyer password (e.g. submitted as a part of the transaction) and compares with a stored authentication hash value (determined and stored during the registration of the user/buyer). If the values do not match the verification/authentication fails. If the values do match, the purchase module dynamically regenerates the private key of the user/buyer using the received key derivation parameters and signs the transaction request in order to form the buyer/user pending transaction object. In a similar manner, the purchase module is able to request, receive and generate the private key of the seller and then sign the transaction request in order to form the seller pending transaction object. In some embodiments, the purchase module decrypts PPI requested by the seller and re-encrypts the data using the seller's public key such that it can later be viewed by the seller (e.g. upon completion of the transaction using the authentication module). If the verification/authentication fails, the transaction request is rejected and the transaction is terminated.

The pending transaction object is able to comprise information about the transaction including, but not limited to, one or more of: the terms of the contract for the product (as input to the platform by the seller as described above), the buyer unique identifier, the seller unique identifier, the product(s) identifier(s), the date/time, a transaction hash, a generated transaction identifier, product(s) information and/or other data about the transaction. The purchase module is able to determine the appropriate product contract information/terms using the product identifier included in the purchase request as an pointer to the product information and contract terms on the MIDC 202 where it was uploaded by the seller (as described above).

For each generated pending transaction object, the anti-poisoning module inputs the transaction and determines if it includes any illegal, malicious, cybersecurity compromising, ransomware, malware, phishing or pornographic content etc., (e.g. using image and text analysis engines; identifying if the object includes any extraneous data; identifying if the object has the correct format and/or comparing the data of the transaction object to a set of known illegal images, malware, ransomware, phishing and/or other data). If illegal content is found, the module is able to terminate the transaction object and/or remove the illegal content from the object or rejects the transaction in its entirely and removes the content and pending block by deleting it from the system. It is able to in some embodiments delete the user and their MIDC from the system altogether.

If the anti-poisoning module approves the pending transaction objects of the buyer and the seller, the purchase module posts the pending transactions objects to the buyer and seller MIDCs 202, respectively, signs the pending transaction object with both the buyer and seller private keys, and transmits the signed pending transaction object to the notary module/notary chain 206′. In some embodiments, the signing comprises sending confirmation requests to the seller/buyer devices 104, 106, wherein the confirmation requests comprise a challenge message that needs to be digitally signed by the buyer and seller devices 104, 106 using their respective buyer/seller encrypted keys (e.g. as dynamically generated by the key module upon request). These digital signatures are able to later be validated by notary module (e.g. using the associated paired keys known by the key module) as a part of determining if there is consensus for the transaction as described below. The notary module receives these signed pending transaction objects and puts them in a queue for posting and sends them to the payment processing module for payment processing.

After the notary module receives the signed pending transaction objects, the payment processing module processes the payment indicated in the smart contract(s). For example, for an external gateway payment, once the notary module broadcasts a pending transaction object (that has been signed/confirmation by seller and buyer), the payment processing module processes the associated payment against the proper payment gateway. If instead payment is to be via a platform currency, the payment processing module requests/receives from the buyer MIDC 202 digital tokens from the account associated with the buyer identifier equal to the price indicated in the smart contract, and transfers the money/tokens to the owed parties (e.g. the account of the seller identifier and/or the system fee account). In some embodiments, the payment processing module ensures that all tokens/monies remain within the control of the operating system 206 and/or a central authority until a physical withdrawal is effectuated by a user. If one or more tokens, or fiat currencies, are stolen from a buyer and/or seller account, because all users are known because they must have been previously on-boarded and registered on a permissioned chain, the platform 102 is able to trace the tokens and record on the notary blockchain 206′ that the tokens are no longer valid as well as replacing the stolen tokens in the account with newly minted tokens. In either case, if the payment is successful, the notary module then signs the pending transaction object (e.g. via the key module using a notary private encryption key) thereby forming a completed transaction object using the notary keys, and posts the completed transaction object as a single transaction block on the notary blockchain 206′.

The notary module then creates completed transaction confirmation blocks, signs each of the blocks using the notary private key (e.g. via the key module) and posts them as a single transaction block on each of the buyer and seller MIDCs 202 (appended to the blocks including the pending transaction objects). Thus, for each completed transaction, there will be two blocks posted to each of the buyer and seller MIDCs 202 (pending/initiated and completed transaction blocks) and one block posted on the notary blockchain 206′ (completed transaction block). If the payment processing fails or the transaction is otherwise terminated after posting of the pending transaction object blocks, then no transaction block is added to the notary blockchain 206′, and instead of the completed transaction, the notary module posts a failed transaction block (indicating what caused the transaction to fail) on the buyer and seller MIDCs 202. As described above, using a P-RAFT protocol, the processing/recordation of each of the (pending or completed) transactions/blocks is able to be assigned by the notary module to a particular horizontal partition of the notary blockchain 206′ (and/or MIDCs 202) and performed by a node designated as the leader of that partition. In some embodiments, as described above, the platform includes a buffer memory pool that stores transactions that need to be recorded until the node to which they are assigned is ready to process/record them.

The completed transaction blocks (posted to the notary blockchain 206′ and/or buyer and seller MIDCs 202) are able to be time-stamped, posted ordered and validated in real-time. In particular, unlike other blockchain systems, the notary module posts the block without first waiting for a full node consensus that the transaction is valid (e.g. not fraudulent). This enables the platform 206 to post transactions faster than any existing blockchain system resulting in greater throughput and efficiency of the platform 206. The posted block is able to indicate the terms of the transaction (e.g. price, date, payment, and other transaction data) or a reference to a smart contract for that transaction, as well as the seller and buyer encrypted unique identifiers (and/or the product identifier). Additionally, the transaction is posted as a single transaction block on the notary blockchain 206′, the transaction is able to be later corrected by adding a new single transaction block to the blockchain 206′ that indicates any necessary modifications to the original block. In some embodiments, the platform also effectuates the delivery of the product by digitally delivering the product to the buyer (e.g. buyer device 104) if a digital product or sends a message to the seller to deliver the digital or non-digital product to the buyer (e.g. buyer device 104 or buyer shipping address).

In some embodiments, the ledger module is used to maintain an account balance of one or more currency values on one or more of the user accounts. In such embodiments, upon completion of a transaction, the ledger module posts a new single transaction block on the buyer and seller MIDCs 202 indicating the adjustment to the existing account balance to the seller/buyer accounts on the seller and buyer MIDCs 202, respectively. Again, each of these transactions is added to their MIDCs 202 as a single transaction block (rather than multiple transactions in a single block) such that if there is a dispute or error, the single transaction block having the error is able to be corrected by a new updated single transaction block added to the MIDCs 202. For example, a fraudulent charge indicated in a first single transaction block on the MIDC 202 of the buyer is able to be corrected by a subsequent updated single transaction block (e.g. completed dispute block) crediting the charged amount back to the account (thereby correcting the indicated account total). This would not be possible if a single block was used for multiple transactions because the fraudulent transaction could not be corrected without also affecting all the other non-fraudulent transactions contained within that block. Alternatively, in the case where buyer/seller accounting is provided external to the platform 102, the ledger module and/or the MIDC 202 account balance blocks are able to be omitted.

At the same time as the pending transaction object signing, payment processed and/or posting of the completed transaction blocks (e.g. before, simultaneously or concurrently), the security module is able to perform a proof of transaction consensus process on the transaction in order to validate the transaction is not fraudulent or otherwise invalid. In some embodiments, the security module performs the proof of transaction consensus process by verifying that the buyer encryption keys used to sign the transaction are valid keys (e.g. that are associated with the encrypted buyer identifier using a hash verification of the keys). In some embodiments, the security module/engine includes artificial intelligence in order to aid in the speedy determination of consensus of each of the transactions. If the proof of transaction fails, the security module/engine notifies the notary module and the ledger module (if it is being implemented) so the notary module is able to post a new single transaction block correcting (e.g. nullifying) the transaction on the notary blockchain 206′ and the ledger module is able to similarly post new single transaction blocks correcting the account balances of the seller and buyer on the seller/buyer MIDCs 202.

The dispute module receives transaction disputes from buyer and/or seller devices 104, 106 and resolves the disputes even after the single transaction block of the transaction has been posted to the notary blockchain 206′ without compromising immutability of the blockchain 206′. Specifically, the dispute module operates as the central authority by determining if the smart contract conditions were met (e.g. payment made, product delivered) and adjudicates disputes and determine resolution adjustments (if necessary) to the disputed transaction. In response to receipt of a dispute request message from a user (e.g. buyer/seller) identifying a disputed posted transaction, the dispute module is able to generate and post pending dispute objects as single blocks on the notary blockchain 206′ as well as the MIDCs 202 of the sellers, buyers and/or other entities that are a part of the transaction. In some embodiments, the dispute request message includes one or more of the transaction identifier, the buyer and/or seller identifiers (e.g. alphanumeric identifiers), the date of the transaction and/or other transaction data. These pending dispute blocks identify the disputed transaction in order to indicate to others inspecting the transaction (for any reason) that the transaction is currently disputed. Alternatively, the generation and posting of the pending dispute objects/blocks are able to be omitted.

Subsequently, in response to determination of the resolution of the dispute (e.g. as entered by an administrator; as indicated by a third party entity; as automatically determined by the dispute module programming), the dispute module generates and posts a completed dispute objects as single blocks on the notary blockchain 206′ as well as the MIDCs 202 of the sellers, buyers and/or other entities that are a part of the transaction. These completed dispute objects are able to indicate changes to the identified transaction (if any) and confirm that the dispute has been resolved thereby correcting any previously posted block of the disputed transaction. For example, the completed dispute blocks are able to indicate one or more changes to the transaction including but not limited to: that the existing transaction values are verified (e.g. no changes were necessary); that the transaction is voided (returning funds from the seller to the buyer and rights to the product from the buyer to the seller); and that the transaction parameters are adjusted (adjusting the funds from the buyer to the seller or vice versa; adjusting a length of the transaction (e.g. a movie rental duration), and/or adjustments to any of the other transaction data of the transaction included in the completed transaction block). In such embodiments where the pending dispute blocks are omitted, if there are no changes as a result of the dispute resolution, the dispute module is able to refrain from posting any new blocks (because the existing blocks are still accurate as indicated by the dispute resolution).

As a result, related transactions (original blocks and subsequent corrections) are able to be readily grouped by and easily viewed on the chains 202, 206′ as a “family” of blocks all related to the same transaction and or specific user, buyer or seller. Thus, the dispute module provides the benefit of being able to effectuate reconciliation of a dispute within the platform 102 without compromising the immutability of the blockchain 206′. Similarly, the platform 102 provides the benefit of being able to run transaction processing, validation and posting of ordered single transaction blocks in real-time (e.g. posting before consensus is complete) as well as providing dispute resolution in order to correct errors and/or fraudulent charges.

In some embodiments, the platform 102 implements a delayed block posting protocol comprising delaying the posting of one or more of the blocks to the target blockchains for a predefined delay period. In particular, this delay period is able to provide the advantage of ensuring that the blockchains are not poisoned by any blocks by adding time to determine whether the blocks are safe to post before posting them. The platform 102 enables the duration of the predetermine delay period for each of the blockchains to be manually input and/or automatically determined by the platform based on one or more of the source of the block (e.g. account identifiers, transaction identifiers), the type of blockchain (e.g. notary, MIDC), the type of block (e.g. pending transaction, completed transaction or other type of block as described herein), other data stored on the block as described herein, the network load, the processing power and/or the consensus results. In some embodiments, the platform 102 automatically dynamically adjusts the predetermined delay period during operation based on one or more of the above factors. As a result, each of the blockchains are able to have the same or different delay periods. In some embodiments, the delay is implemented before consensus for the block is determined Alternatively, the delay is able to be implemented after the consensus is determined, but before the block is posted.

In some embodiments, the dispute module includes a loss mitigation function/engine (e.g. powered by artificial intelligence and/or machine learning) that monitors transactions submitted to the notary blockchain operating system 206 and identifies and stops suspicious transactions from being completed (e.g. from being recorded on the blockchains at all). In some embodiments, one or more of the modules involved in the purchase process are able to be combined. For example, in some embodiments the purchase modules is able to be a part of the authentication module/rosetta.

Operating Method

FIG. 3 illustrates a method of implementing a blockchain transaction platform 102 according to some embodiments. As shown in FIG. 3, a micro-identification engine of the blockchain transaction operating system generates a micro-identification blockchain array 204 at the step 302. In some embodiments, the array 204 formed by a stack of a plurality of micro-identification blockchains 202, wherein each one of the micro-identification blockchains 202 is dedicated to a single one of the users such that the one of the micro-identification blockchains 202 stores a native identifier of one of the users, a coded identifier of the one of the users and a set of personal information about the one of the users. The micro-identification engine receives a transaction request from a user device 104, 106 at the step 304. In some embodiments, the transaction request identifies a pending transaction object between a group of the users, wherein the pending transaction object is digitally signed by the private digital key of each user of the group. The micro-identification engine generates and posts the pending transaction object as a pending transaction block on the micro-identification chain 202 of each user of the group of the users at the step 306. The micro-identification engine transmits the pending transaction object to a notary engine of the operating system 206 at the step 308.

The notary engine attempts to facilitate execution of terms of a transaction identified by the pending transaction object including a transfer of funds between the group of the users at the step 310. If the attempt is successful, the notary engine generates and posts a transaction-completed block on the notary blockchain 206′ at the step 312. The transaction-completed block indicates that the transaction identified by the pending transaction object is completed. The notary engine transmits copies of the transaction-completed block to the micro-identification blockchain 202 at the step 314. If the attempt is unsuccessful, the notary engine generates a transaction-failed block indicating that the transaction identified by the pending transaction object could not be completed at the step 316. The notary engine transmits copies of the transaction-failed block to the micro-identification engine at the step 316. The micro-identification engine posts the transaction completed blocks and the transaction-failed blocks on the micro-identification blockchains 202 of each of the group of the users upon receipt from the notary blockchain engine at the step 318.

In some embodiments, generating the micro-identification array 204 comprises generating each of the micro-identification blockchains 202 by generating a first block of the micro-identification blockchain 202 including the native identifier, the encoded identifier and the set of personal information; encrypting the encoded identifier and the set of personal information; and generating and appending a second block to the first block, the second block including the encoded identifier and the set of personal information as encrypted. In some embodiments, the notary engine is able to access blocks of the micro-identification blockchains 202 including the encoded identifier and the set of personal information as encrypted, but restricted from accessing any blocks of the micro-identification chains 202 that include the native identifier. In some embodiments, the micro-identification array 204 is logically organized such that each of the micro-identification chains 202 form a logical row and an initial block of each of the stack of the micro-identification blockchains 202 form a logical first column and each subsequent block of each of the stack of the micro-identification blockchains 202 form logical subsequent columns.

In some embodiments, the method further comprises importing a database having stacked rows of cells of data with a block loader module by converting each row of the database into a new logical row of the array 204 formed by a new micro-identification blockchain 202 with each cell of the row of the database forming a new block of the new micro-identification blockchain 202. In some embodiments, the method further comprises, with the compliance module, identifying a geographic location of each one of the users when the users registered with the platform 102 and each time the users initiate a transaction on the platform 102; determining a set of stored data privacy rules that apply to the geographic location; and applying the set of data privacy rules to data added to the micro-identification blockchain 202 of the one of the users. In some embodiments, the method further comprises, in response to the one of the users selecting a right of erasure command, deleting the micro-identification blockchain 202 of the one of the users with the compliance module.

In some embodiments, the method further comprises, in response to the one of the users selecting a right of erasure command, storing a time that the command was received; determining an applicable set of the set of stored data privacy rules that apply to the one of the users and if the applicable set includes an erasure delay period; deleting the micro-identification blockchain 202 of the one of the users if the applicable set does not include the erasure delay period; and refraining from deleting the micro-identification blockchain 202 of the one of the users at the time that the command was received for the erasure delay period and deleting the micro-identification blockchain 202 of the one of the users after the erasure delay period has expired if the applicable set includes the erasure delay period. In some embodiments, the method further comprises determining if the pending transaction object includes illegal, malicious, cybersecurity compromising, hacking, phishing, malware or ransomware, type content and preventing posting of the pending transaction block if the pending transaction object includes illegal, malicious, cybersecurity compromising, hacking, phishing, malware or ransomware, type content with the anti-poisoning module. In some embodiments, the private digital keys are not stored on the platform 102 and the method further comprises dynamically regenerating the private digital keys with the key module upon request by one of the users. In some embodiments, the posting of the transaction-completed block on the notary blockchain 206′ is performed before consensus for the transaction has been determined, the transaction-completed block including transaction data describing the transaction.

As a result, the method provides the advantage of providing MIDCs for storing user personal data and/or transactions thereby ensuring their safety over data stored on traditional databases while still enabling data privacy law and regulatory law compliance. Further the method provides the benefit of enabling transactions to be quickly posted before full node consensus has been determined while also being correctable due to each block only storing a single transaction such that errors are able to be corrected to subsequent single transaction correction blocks. This in contrast to other blockchain systems where full node consensus is required before blocks are able to be posted and thousands of transactions are stored on a transaction blocks containing multiple transactions such that to change an error on a block with a new single transaction block would require costly disruption of all of the other transactions that do not include an error on that block—which would also compromise the immutability of those existing chains due to their existing architectures. Further, the method provides the advantage of retaining the benefits of the immutability of the blockchains while still being automatically GDPR, CCPA and other data privacy law compliance and able to fully de-identify any user data/and or user stored private personal information at the request of the user without compromising the immutability of the systems on-chain blocks and blockchains. Moreover, the method provides the advantage of preventing block poisoning by implementing block screening before any block is posted on the notary chain 206′ or MIDCs 202. Finally, the method provides the advantage of dynamically generating keys such that they cannot be phished from users or stolen from inside the platform 102.

Exemplary Device

FIG. 4 illustrates a block diagram of an exemplary computing device 400 according to some embodiments. The computing device 400 is able to be one or more of the operating system 206, devices 104, 106, the blockchain 206′ (e.g. each node of the blockchain 206′) and/or other electronic devices described herein. In general, a hardware structure suitable for implementing the computing device 400 includes a network interface 402, a memory 404, a processor 406, I/O device(s) 408, a bus 410 and a storage device 412. Alternatively, one or more of the illustrated components are able to be removed or substituted for other components well known in the art. The choice of processor is not critical as long as a suitable processor with sufficient speed is chosen. The memory 404 is able to be any conventional computer memory known in the art. The storage device 412 is able to include a hard drive, RAM, SRAM, CDROM, CDRW, DVD, DVDRW, flash memory card or any other storage device. The computing device 400 is able to include one or more network interfaces 402. An example of a network interface includes a network card connected to an Ethernet or other type of LAN. The I/O device(s) 408 are able to include one or more of the following: keyboard, mouse, monitor, display, printer, modem, touchscreen, button interface and other devices. The operating system(s), graphical user interface(s), application(s), module(s) and/or other software 430 used to operate the device 400 are likely to be stored in the memory 404 and/or storage device 412 and processed as applications are typically processed via the processor 406. More or less components shown in FIG. 4 are able to be included in the computing device 400. In some embodiments, hardware 420 is included. Although the computing device 400 in FIG. 4 includes software 430 and hardware 420, the features/functions of the system 100 and device 400 are able to be implemented on the computing device 400 in hardware, firmware, software or any combination thereof. Examples of suitable computing devices include a personal computer, a laptop computer, a computer workstation, a server, a datacenter, a mainframe computer, a handheld computer, a personal digital assistant, a cellular/mobile telephone, a smart appliance, a gaming console, a digital camera, a digital camcorder, a camera phone, an iPod™, a video player, a DVD writer/player, a Blu-ray™ writer/player, a television, a home entertainment system or any other suitable computing device. Further, it is understood that the system 100 and/or platform 102 is able to be deployed in single server or cluster of servers modes as well as on premises, data center, dedicated data center or via cloud computing environments and/or combinations thereof.

Use Cases

In some embodiments, the transactions are able to be initiated as a part of an International Token Exchange (ITX) module/engine. In particular, the ITX module is able to be an SEC and FINRA compliant module/engine (e.g. implemented using a downloadable or non-downloadable application, website, or combination thereof) to allow for the automated blockchain based trading and instant settlement of tokenized securities of any kind using the platform 102. As a result, the ITX module provides the benefit of being the only platform 102 capable of recording such transactions, along with buyer and seller PPI via the automated engine/platform that does so in a fully data privacy and regulatory law complaint manner

In some embodiments, the platform 102 comprises an electronic learning data privacy law and regulatory law compliance module/engine that enables educational tools to seamlessly comply with data privacy and regulatory laws. Specifically, the compliance engine/module is able to function as middleware between schools and eLearning providers as an automated, real-time data privacy law and regulatory laws compliance engine. First, it insures that the data and private personal information of the school's student population is always on-boarded, collected, curated, stored and deleted (when required) in compliance with all global, federal and state data privacy and regulatory law in an autonomous, 24/7, zero-trust manner. Second, it ensures that all student data is stored on its impenetrable and fully cyber-secured platform. As a result, that student data cannot be hacked, ransomed or phished.

In some embodiments, the platform 102 comprises a human resource engine/module that uniquely enables a company's human resource division to interact with its employees, on a private, secure, data privacy and regulatory law compliant level, to ascertain if their employees have had, and passed, a test (e.g. Covid-19 antibody test) in order to allow them to safely return to the workplace. In particular, the human resource engine/module enables a company to upload its employee database to an iteration of the platform 102 (e.g. its own private iteration). Then through a browser portal and/or application of the platform/human resource engine, the company is able to select to issue a companywide message (e.g. email, text, other electronic message or a combination thereof), specific department messages or just an individual message apprising the recipient(s) that the company is now using the human resource engine to ensure a safe workplace (e.g. regarding covid-19).

The message will then direct the recipient(s) to download the human resource engine app which dynamically determines and provides locations and/or directions to locations where acceptable antibody testing is being done. Further, the engine issues each employee a unique QR code (or other unique identifier) which in turn allows the testing lab to securely upload that person's covid-19 antibody test data (and/or other test data) to the human resource engine/module to be stored on the platform 102 (e.g. on an MIDC for that employee) preserving the authenticity of the results.

During the initial on-boarding process for an individual employee, the human resource engine/module captures all appropriate privacy and regulatory permissions (e.g. HIPPA) to allow the results of the test (e.g. covid-19 antibody lab test) to be legally shared with the employer from either the individual, or from the lab. In particular, the platform allows such sharing to be zero-trust, fully automated and regulatory law compliant. The on-boarding process for each individual by the engine/module is also able to capture permissioned biometrics from that individual such that the engine/module provides the benefit of dynamically updating biometric lock specific to each user. This also allows the platform 102 to uniquely ensure that the only party that ultimately controls an employee's Private Personal Information is that employee/individual.

In some embodiments, the human resource engine/module provides a graphical user interface (e.g. via a mobile application and/or website) that allows a person to display or export their testing status at will, and in real time. It also is able to allow human resources at a company to see their employees' real-time test results (e.g. covid-19 antibody status), again in a user permissioned and privacy law compliant manner, from a desktop browser accessing the platform 102. In some embodiments, a user that currently has a medical status (e.g. covid-19 positive), or has not gotten tested yet (e.g. anti-body tested), would have their status visibly demonstrated (e.g. by an unmistakable RED background displayed behind their picture on the graphical user interface of the application and/or website. Further, a user that has had a test, but where the lab results are still pending is able to have a different indicator (e.g. a YELLOW background displayed behind their picture), and a user that has not only had an antibody test, but who has passed that covid-19 antibody test would have another different indicator (e.g. a GREEN background displayed behind their picture). Alternatively, other indicators are able to be used. Further, although antibody tests and/or covid-19 tests are described herein as examples, other tests and/or medical conditions are able to be used.

Advantages

The system 100 described herein have numerous advantages. In particular, the system 100 provides the advantage of enabling a high throughput of transactions recorded on the central public/private hybrid blockchain, or a central private permissioned blockchain, without sacrificing the immutability of the blockchain by utilizing a posting of transactions with a proof of transaction consensus before any full node consensus protocol combined with using separate single transaction blocks for each transaction such that errors can be corrected with subsequent blocks. Further, it provides the advantage of protecting against chain poisoning by implementing an anti-poisoning module that prevents poisoned blocks from being posted to the blockchain. Additionally, the system 100 provides the increased security of micro-identification chains instead of databases which are susceptible to breaches. Moreover, the system 100 provides a compliance module that automatically complies with privacy regulations for all on-boarded user PPI. Also, it provides a block explorer module that enables databases to easily be imported into the MIDC arrays. Further, the system 100 enables the users to remain in complete control of their personal data without disrupting the immutability of the notary/transaction blockchain by including a ripcord feature (to effectuate erasure or deletions) that fully de-identifies and/or anonymizes any user who wishes to discontinue using the service.

The present invention has been described in terms of specific embodiments incorporating details to facilitate the understanding of principles of construction and operation of the invention. Such reference herein to specific embodiments and details thereof is not intended to limit the scope of the claims appended hereto. It will be apparent to those skilled in the art that modification may be made in the embodiments chosen for illustration without departing from the spirit and scope of the invention. For example, in some embodiments the application includes a deadbolt function that provides real-time feedback on the smart contracts that the blockchain operating system generates as well as providing alerts on suspicious activity in order to prevent the activity from taking place. In some embodiments, the transfer of tokens and/or other moneys described herein between the operating systems/blockchains (e.g. for effectuating payments and/or issuing pre-order tokens) is effectuated used the pegged sidechains as a method of transferring the tokens between the blockchains/operating systems. As used herein, a user, buyer and/or seller is able to be any entity (e.g. person, business, fund, government entity) that is able to be due compensation on the system 100 (e.g. for a transaction and/or other feature). Specifically, even if they are not a part of the process, the entities are able to have accounts on the system such that the system is able to compensate them as necessary (e.g. as indicated in the smart contracts).

Further, although the functions of the platform 102 and/or operating system 206 have been divided according to an exemplary number of modules having an exemplary subset of the functions of the platform 102, it is understood that other divisions and/or numbers of modules are contemplated (with the overall functionality of the platform 102 being the same), but omitted for the sake of brevity. Further, it is understood that the functions described herein as being performed by operating systems, applications, modules, graphical user interfaces and/or other types of software are performed via the software being stored on a non-transitory computer readable memory of and executed by one or more processors of one or more of the electronic devices described herein (in combination with or separately from other hardware such as wireless transceivers). Similarly, it is understood that functions described herein as being performed by devices, servers, blockchains, MIDCs and/or other types of electronic devices are performed via non-transitory computer readable memory and one or more processors of the electronic devices storing and executing one or more operating systems, applications, modules, graphical user interfaces and/or other types of software (in combination with or separately from other hardware of the electronic devices such as wireless transceivers). As used herein, the term “transaction” is able to also refer to an “object” and vice versa. 

What is claimed is:
 1. A blockchain transaction platform for recording transactions between a plurality of users having accounts and assigned unique identifiers and assigned public and private digital key pairs on the platform, the platform comprising: a plurality of processing nodes of a notary blockchain, the nodes each having a node processor, a node memory storing a notary module and a blockchain memory partitioned into a plurality of horizontal partitions, the notary blockchain including a plurality of transaction blocks; and at least one platform server including at least one platform processor and a non-transitory computer-readable medium storing a platform operating system, wherein when executed by the platform processor the platform operating system performs the steps of: for each of the partitions, assigning a different one of the nodes as a leader for that partition; receiving a plurality of blockchain transaction objects each including a unique transaction identifier and details of a single transaction between any two or more of the users; assigning each of the blockchain transaction objects to one of the partitions; and providing each of the blockchain transaction objects to the one of the nodes that is the leader of the partition that the object is assigned to; wherein when executed by the node processor, the notary module of each node of the nodes performs the steps of: receiving a number of the blockchain transaction objects; and for each of the number: determining whether the blockchain transaction object is assigned to the partition that the node is the leader of; determining whether the blockchain transaction object is assigned to one of the partitions that the node is a follower of; storing the blockchain transaction object on the node; sending copies of the blockchain transaction object to followers of the partition that the node is the leader of if the blockchain transaction object was determined to be assigned to the partition that the node is the leader of; in response to receiving a verification message from the platform server indicating that the blockchain transaction object is valid, locally posting the transaction object as a new block on the notary blockchain on the partition that the node is the leader of and distributing a node confirmation message to the followers of the partition that the node is the leader of indicating that the blockchain transaction object is valid; and in response to receiving a node confirmation message from another of the nodes indicating that the blockchain transaction object is valid, locally posting the transaction object as another block on the notary blockchain on the partition to which the blockchain transaction object is assigned that the node is the follower of.
 2. The blockchain transaction platform of claim 1, wherein each of the partitions are a same size.
 3. The blockchain transaction platform of claim 1, wherein at least two of the partitions are different sizes.
 4. The blockchain transaction platform of claim 1, wherein when executed by the platform processor the platform operating system performs the steps of dynamically adjusting a size of one or more of the partitions from an initial size to a different size during operation of the platform.
 5. The blockchain transaction platform of claim 1, wherein the non-transitory computer-readable medium includes a transaction buffer and when executed by the platform processor the platform operating system performs the steps of storing the blockchain transaction objects in the transaction buffer.
 6. The blockchain transaction platform of claim 1, wherein the assigning each of the blockchain transaction objects to the one of the partitions is based on an assignment metric.
 7. The blockchain transaction platform of claim 6, wherein N of the nodes are leaders, the assignment metric is M mod N, and the assigning each of the blockchain transaction objects to the one of the partitions comprises: determining a hash M of the transaction identifier of the blockchain transaction object; and determining M mod N.
 8. The blockchain transaction platform of claim 6, wherein the assigning each of the blockchain transaction objects to the one of the partitions is based on congestion levels of each of the nodes that are one of the leaders.
 9. The blockchain transaction platform of claim 6, wherein the assigning each of the blockchain transaction objects to the one of the partitions comprises: determining whether the blockchain transaction object points to an existing block of the notary blockchain; disregarding results of the assignment metric if the blockchain transaction object does point to the existing block on the notary blockchain; and assigning the blockchain transaction object to the partition of the partitions in which the existing block is stored.
 10. A notary blockchain for recording transactions between a plurality of users having accounts and assigned unique identifiers and assigned public and private digital key pairs, the blockchain comprising: a plurality of processing nodes, the nodes each having a node processor, a node memory storing a notary module and a blockchain memory partitioned into a plurality of horizontal partitions, the notary blockchain including a plurality of transaction blocks, wherein each of the partitions has a leader that is a different one of the nodes and each of the nodes is a follower of one or more of the partitions, and further wherein when executed by the node processor, the notary module of each node of the nodes performs the steps of: receiving a number of blockchain transaction objects each assigned to one of the partitions and including a unique transaction identifier and details of a single transaction between any two or more of the users; and for each of the number: determining whether the blockchain transaction object is assigned to the partition that the node is the leader of; determining whether the blockchain transaction object is assigned to one of the partitions that the node is a follower of; storing the blockchain transaction object on the node; sending copies of the blockchain transaction object to followers of the partition that the node is the leader of if the blockchain transaction object was determined to be assigned to the partition that the node is the leader of; in response to receiving a verification message indicating that the blockchain transaction object is valid, locally posting the transaction object as a new block on the notary blockchain on the partition that the node is the leader of and distributing a node confirmation message to the followers of the partition that the node is the leader of indicating that the blockchain transaction object is valid; and in response to receiving a node confirmation message from another of the nodes indicating that the blockchain transaction object is valid, locally posting the transaction object as another block on the notary blockchain on the partition to which the blockchain transaction object is assigned that the node is the follower of.
 11. The notary blockchain of claim 10, wherein each of the partitions are a same size.
 12. The notary blockchain of claim 10, wherein at least two of the partitions are different sizes.
 13. A blockchain transaction platform server for operating with a plurality of processing nodes of a notary blockchain including a plurality of transaction blocks, the nodes each having a blockchain memory partitioned into a plurality of horizontal partitions, the server comprising: at least one platform processor; and a non-transitory computer-readable medium storing a platform operating system, wherein when executed by the platform processor the platform operating system performs the steps of: for each of the partitions, assigning a different one of the nodes as a leader for that partition; receiving a plurality of blockchain transaction objects each including a unique transaction identifier and details of a single transaction between any two or more of the users; assigning each of the blockchain transaction objects to one of the partitions; and providing each of the blockchain transaction objects to the one of the nodes that is the leader of the partition that the object is assigned to.
 14. The blockchain transaction platform server of claim 13, wherein when executed by the platform processor the platform operating system performs the steps of, for each of the blockchain transaction objects provided to the one of the nodes that is the leader of the partition that the object is assigned to, providing a subsequent verification message to the one of the nodes, the verification message indicating that the blockchain transaction object provided is valid and authorized to be posted on the notary.
 15. The blockchain transaction platform server of claim 13, wherein each of the partitions are a same size.
 16. The blockchain transaction platform server of claim 13, wherein at least two of the partitions are different sizes.
 17. The blockchain transaction platform server of claim 13, wherein when executed by the platform processor the platform operating system performs the steps of dynamically adjusting a size of one or more of the partitions from an initial size to a different size during operation of the platform.
 18. The blockchain transaction platform server of claim 13, wherein the non-transitory computer-readable medium includes a transaction buffer and when executed by the platform processor the platform operating system performs the steps of storing the blockchain transaction objects in the transaction buffer.
 19. The blockchain transaction platform server of claim 13, wherein the assigning each of the blockchain transaction objects to the one of the partitions is based on an assignment metric.
 20. The blockchain transaction platform server of claim 19, wherein N of the nodes are leaders, the assignment metric is M mod N, and the assigning each of the blockchain transaction objects to the one of the partitions comprises: determining a hash M of the transaction identifier of the blockchain transaction object; and determining M mod N.
 21. The blockchain transaction platform server of claim 19, wherein the assigning each of the blockchain transaction objects to the one of the partitions is based on congestion levels of each of the nodes that are one of the leaders.
 22. The blockchain transaction platform server of claim 19, wherein the assigning each of the blockchain transaction objects to the one of the partitions comprises: determining whether the blockchain transaction object points to an existing block of the notary blockchain; disregarding results of the assignment metric if the blockchain transaction object does point to the existing block on the notary blockchain; and assigning the blockchain transaction object to the partition of the partitions in which the existing block is stored.
 23. A method of recording transactions between a plurality of users on a notary blockchain including a plurality of processing nodes, the nodes each having a blockchain memory partitioned into a plurality of horizontal partitions, the method comprising: for each of the partitions, assigning a different one of the nodes as a leader for that partition with a platform server; receiving a plurality of blockchain transaction objects each including a unique transaction identifier and details of a single transaction between any two or more of the users with the platform server; assigning each of the blockchain transaction objects to one of the partitions with the platform server; and providing each of the blockchain transaction objects to the one of the nodes that is the leader of the partition that the object is assigned to with the platform server.
 24. The method of claim 23, further comprising each node of the nodes: receiving a number of the blockchain transaction objects; and for each of the number: determining whether the blockchain transaction object is assigned to the partition that the node is the leader of; determining whether the blockchain transaction object is assigned to one of the partitions that the node is a follower of; storing the blockchain transaction object on the node; sending copies of the blockchain transaction object to followers of the partition that the node is the leader of if the blockchain transaction object was determined to be assigned to the partition that the node is the leader of; in response to receiving a verification message from the platform server indicating that the blockchain transaction object is valid, locally posting the transaction object as a new block on the notary blockchain on the partition that the node is the leader of and distributing a node confirmation message to the followers of the partition that the node is the leader of indicating that the blockchain transaction object is valid; and in response to receiving a node confirmation message from another of the nodes indicating that the blockchain transaction object is valid, locally posting the transaction object as another block on the notary blockchain on the partition to which the blockchain transaction object is assigned that the node is the follower of.
 25. The method of claim 23, wherein each of the partitions are a same size.
 26. The method of claim 23, wherein at least two of the partitions are different sizes.
 27. The method of claim 23, further comprising dynamically adjusting a size of one or more of the partitions from an initial size to a different size with the platform server.
 28. The method of claim 23, further comprising storing the blockchain transaction objects in the transaction buffer on the platform server.
 29. The method of claim 23, wherein the assigning each of the blockchain transaction objects to the one of the partitions is based on an assignment metric.
 30. The method of claim 29, wherein N of the nodes are leaders, the assignment metric is M mod N, and the assigning each of the blockchain transaction objects to the one of the partitions comprises: determining a hash M of the transaction identifier of the blockchain transaction object; and determining M mod N.
 31. The method of claim 29, wherein the assigning each of the blockchain transaction objects to the one of the partitions is based on congestion levels of each of the nodes that are one of the leaders.
 32. The method of claim 29, wherein the assigning each of the blockchain transaction objects to the one of the partitions comprises: determining whether the blockchain transaction object points to an existing block of the notary blockchain; disregarding results of the assignment metric if the blockchain transaction object does point to the existing block on the notary blockchain; and assigning the blockchain transaction object to the partition of the partitions in which the existing block is stored.
 33. The method of claim 23, further comprising, with the platform server, for each of the blockchain transaction objects provided to the one of the nodes that is the leader of the partition that the object is assigned to, providing a subsequent verification message to the one of the nodes, the verification message indicating that the blockchain transaction object provided is valid and authorized to be posted on the notary. 